Decentralised LTL monitoring
نویسندگان
چکیده
منابع مشابه
Decentralised LTL Monitoring
Users wanting to monitor distributed or component-based systems often perceive them as monolithic systems which, seen from the outside, exhibit a uniform behaviour as opposed to many components displaying many local behaviours that together constitute the system’s global behaviour. This level of abstraction is often reasonable, hiding implementation details from users who may want to specify th...
متن کاملEAGLE does Space Efficient LTL Monitoring
We briefly present a rule-based framework, called EAGLE, that has been shown to be capable of defining and implementing finite trace monitoring logics, including future and past time temporal logic, extended regular expressions, real-time and metric temporal logics (MTL), interval logics, forms of quantified temporal logics, and so on. In this paper we show how EAGLE can perform linear temporal...
متن کاملMonitoring Bounded LTL Properties Using Interval Analysis
Verification of temporal logic properties plays a crucial role in proving the desired behaviors of hybrid systems. In this paper, we propose an interval method for verifying the properties described by a bounded linear temporal logic. We relax the problem to allow outputting an inconclusive result when verification process cannot succeed with a prescribed precision, and present an efficient and...
متن کاملMonitoring Business Metaconstraints Based on LTL & LDL for Finite Traces
Runtime monitoring is one of the central tasks to provide operational decision support to running business processes, and check on-the-fly whether they comply with constraints and rules. We study runtime monitoring of properties expressed in LTL on finite traces (LTLf ) and its extension LDLf . LDLf is a powerful logic that captures all monadic second order logic on finite traces, which is obta...
متن کاملA Compositional Hierarchical Monitoring Automaton Construction for LTL
In this paper we give a compositional (or inductive) construction of monitoring automata for LTL formulas. Our construction is similar in spirit to the compositional construction of Kesten and Pnueli [5]. We introduce the notion of hierarchical Büchi automata and phrase our constructions in the framework of these automata. We give detailed constructions for all the principal LTL operators inclu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Methods in System Design
سال: 2016
ISSN: 0925-9856,1572-8102
DOI: 10.1007/s10703-016-0253-8